Monotonicity in the limited processor sharing queue
نویسندگان
چکیده
We study a processor sharing queue with a limited number of service positions and an infinite buffer. The occupied service positions share an underlying resource. We prove that for service times with a decreasing failure rate, the queue length is stochastically decreasing in the number of service positions, and that for service times with an increasing failure rate, the queue length is stochastically increasing. The result is illustrated with simulations, and the queue length is compared to that in other queueing models with and without restrictions on the number of service positions.
منابع مشابه
On the stability of the multi-queue multi-server processor sharing with limited service
We consider a multi-queue multi-server system with n servers (processors) and m queues. At the system there arrives a stationary and er-godic stream of m different types of requests with service requirements which are served according to the following k-limited head of the line processor sharing discipline: The first k requests at the head of the m queues are served in processor sharing by the ...
متن کاملLaw of Large Number Limits of Limited Processor-Sharing Queues
Motivated by applications in computer and communication systems, we consider a processor sharing queue where the number of jobs served is not larger than K. We propose a measure-valued fluid model for this limited processor sharing queue and show that there exists a unique associated fluid model solution. In addition, we show that this fluid model arises as the limit of a sequence of appropriat...
متن کاملA Note on the Stability of the Many - Queue Head - of - the - LineProcessor - Sharing System with Permanent CustomersAndreas
We consider a single server system consisting of n queues with diierent types of customers and k permanent customers. The permanent customers and those at the head of the queues are served in processor-sharing by the service facility (head-of-the-line processor-sharing). By means of Loynes' monotonicity method a stationary work load process is constructed and using sample path analysis general ...
متن کاملA Gated Processor - Sharing M / G / 1 Queue with Limited Number of Service Positions
In this note, we consider a single server queue with gated processor-sharing discipline. Customers arrive according to a Poisson process with rate A and service times are independent and identically distributed (i.i.d.) as an arbitrary random variable S with distribution function H(t) and LST H(s). In the gated processor-sharing discipline, when an arriving customer finds the queue empty, he is...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کامل